WORST_CASE(?,O(n^1))

Solution:
---------

  "a" :: [] -(0)-> "A"(11)
  "a" :: [] -(0)-> "A"(15)
  "a" :: [] -(0)-> "A"(10)
  "a__f" :: ["A"(11)] -(12)-> "A"(11)
  "f" :: ["A"(11)] -(11)-> "A"(11)
  "f" :: ["A"(15)] -(15)-> "A"(15)
  "f" :: ["A"(1)] -(1)-> "A"(1)
  "g" :: ["A"(0)] -(0)-> "A"(15)
  "g" :: ["A"(0)] -(0)-> "A"(13)
  "mark" :: ["A"(15)] -(1)-> "A"(11)


Cost Free Signatures:
---------------------

  "a" :: [] -(0)-> "A"_cf(0)
  "a__f" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "f" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "g" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "mark" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"a\"_A" :: [] -(0)-> "A"(1)
  "\"f\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"g\"_A" :: ["A"(0)] -(0)-> "A"(1)